Midterm Computational Complexity February 28, 2014 You are not allowed to collaborate or refer to any book or

Source URL: www.cs.nyu.edu

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome!

Source URL: theory.cs.princeton.edu

EUROGRAPHICS ’M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19, (2000), Number 3 Context-based Space Filling Curves

Source URL: theory.stanford.edu

• Mathematics
• Graph theory
• Computational complexity theory
• Fractal curves
• Television technology
• NP-complete problems
• Spanning tree
• Computer graphics
• Hilbert curve
• Space-filling curve
• Curve
• Peano curve

Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland

Source URL: www.ru.is

• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• Theoretical computer science
• Maximum cut
• Approximation algorithm
• International Colloquium on Automata
• Languages and Programming
• Algorithmica
• Halldrsson
• International Symposium on Algorithms and Computation
• European Symposium on Algorithms
• Graph coloring

University of California Los Angeles Low Complexity Spectral Imputation for Noise Robust Speech Recognition

Source URL: www.seas.ucla.edu

• Computational linguistics
• Computing
• Data
• Humancomputer interaction
• Automatic identification and data capture
• Computer accessibility
• Speech recognition
• Imputation

Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

Source URL: fc15.ifca.ai

• Cryptography
• Computational complexity theory
• Distance-bounding protocol
• Public-key cryptography
• Complexity classes
• Proof of knowledge
• IP
• Challengeresponse authentication
• NP
• Digital signature
• Security parameter
• Negligible function

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 The Work of Daniel A. Spielman Gil Kalai Dan Spielman has made groundbreaking contributions in theoretical computer

Source URL: www.icm2010.in

• Mathematics
• Computational complexity theory
• Computer science
• Analysis of algorithms
• Linear programming
• Operations research
• Mathematical optimization
• Smoothed analysis
• KleeMinty cube
• Simplex algorithm
• Daniel Spielman
• Algorithm

nd 2 Summer School in Computational Biology Analyzing high-dimensional data in biology

Source URL: www.bio-complexity.com